Simulation-based comparison of pull-push system in motorcycle assembly line

To investigate the effects of adopting a pull system in assembly lines in contrast to a push system, simulation software called “ARENA” is used as a tool in order to present numerical results from both systems. Simulation scenarios are created to evaluate the effects of attributes changing in assembly systems, with influential factors including the change of manufacturing system (push system to pull system) and variation of demand. Moreover, pull system manufacturing consists of the addition attribute, which is the number of buffer storage. This paper will provide an analysis based on a previous case study, hence process time and workflow refer to the journal name “Optimising and simulating the assembly line balancing problem in a motorcycle manufacturing company: a case study” [2]. The implementation of the pull system mechanism is to produce a system improvement in terms of the number of Work-In-Process (WIP), total time of products in the system, and the number of finished product inventory, while retaining the same throughput.

Assembly line balancing the comparison of COMSOAL and MSNSH technique in Motorcycle manufacturing company

Today’s highly competitive market influences the manufacturing industry to improve their production systems to become the optimal system in the shortest cycle time as possible. One of most common problems in manufacturing systems is the assembly line balancing problem. The assembly line balancing problem involves task assignments to workstations with optimum line efficiency. The line balancing technique, namely “COMSOAL”, is an abbreviation of “Computer Method for Sequencing Operations for Assembly Lines”. Arcus initially developed the COMSOAL technique in 1966 [1], and it has been mainly applied to solve assembly line balancing problems [6]. The most common purposes of COMSOAL are to minimise idle time, optimise production line efficiency, and minimise the number of workstations. Therefore, this project will implement COMSOAL to balance an assembly line in the motorcycle industry. The new solution by COMSOAL will be used to compare with the previous solution that was developed by Multi‐Started Neighborhood Search Heuristic (MSNSH), which will result in five aspects including cycle time, total idle time, line efficiency, average daily productivity rate, and the workload balance. The journal name “Optimising and simulating the assembly line balancing problem in a motorcycle manufacturing company: a case study” will be used as the case study for this project [5].

Resource Efficient Configuration of an Aircraft Assembly Line

The design of efficient assembly systems can significantly contribute to the profitability of products and the competitiveness of manufacturing industries. The configuration of a an efficient assembly line can be supported by suitable methodologies and techniques, such as design for manufacture and assembly, assembly sequence planning, assembly line balancing, lean manufacturing and optimization techniques. In this paper, these methods are applied with reference to the industrial case study of the assembly line of a Skycar light aircraft. The assembly process sequence is identified taking into account the analysis of the assembly structure and the required precedence constraints, and diverse techniques are applied to optimize the assembly line performance. Different line configurations are verified through discrete event simulation to assess the potential increase of efficiency and throughput in a digital environment and propose the most suitable configuration of the assembly line.

Virtual Ergonomics and Time optimization of a Railway Coach Assembly Line

The recent drive towards timely multiple product realizations has caused most Manufacturing Enterprises (MEs) to develop more flexible assembly lines supported by better manufacturing design and planning. The aim of this work is to develop a methodology which will support feasibility analyses of assembly tasks, in order to simulate either a manufacturing process or a single work-cell in which digital human models act. The methodology has been applied in a case study relating to a railway industry. Simulations were applied to help standardize the methodology and suggest new solutions for realizing ergonomic and efficient assembly processes in the railway industry.

Simple heuristics for the assembly line worker assignment and balancing problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Simple heuristics for the assembly line worker assignment and balancing problem

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the well-known simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.

Toward an assembly line for U7 snRNPs: interactions of U7-specific Lsm proteins with PRMT5 and SMN complexes.

The survival of motor neurons (SMN) complex mediates the assembly of small nuclear ribonucleoproteins (snRNPs) involved in splicing and histone RNA processing. A crucial step in this process is the binding of Sm proteins onto the SMN protein. For Sm B/B', D1, and D3, efficient binding to SMN depends on symmetrical dimethyl arginine (sDMA) modifications of their RG-rich tails. This methylation is achieved by another entity, the PRMT5 complex. Its pICln subunit binds Sm proteins whereas the PRMT5 subunit catalyzes the methylation reaction. Here, we provide evidence that Lsm10 and Lsm11, which replace the Sm proteins D1 and D2 in the histone RNA processing U7 snRNPs, associate with pICln in vitro and in vivo without receiving sDMA modifications. This implies that the PRMT5 complex is involved in an early stage of U7 snRNP assembly and hence may have a second snRNP assembly function unrelated to sDMA modification. We also show that the binding of Lsm10 and Lsm11 to SMN is independent of any methylation activity. Furthermore, we present evidence for two separate binding sites in SMN for Sm/Lsm proteins. One recognizes Sm domains and the second one, the sDMA-modified RG-tails, which are present only in a subset of these proteins.

A Multi Ant Colony Optimization algorithm for a Mixed Car Assembly Line

This paper presents an ant colony optimization algorithm to sequence the mixed assembly lines considering the inventory and the replenishment of components. This is a NP-problem that cannot be solved to optimality by exact methods when the size of the problem growth. Groups of specialized ants are implemented to solve the different parts of the problem. This is intended to differentiate each part of the problem. Different types of pheromone structures are created to identify good car sequences, and good routes for the replenishment of components vehicle. The contribution of this paper is the collaborative approach of the ACO for the mixed assembly line and the replenishment of components and the jointly solution of the problem.

MILP for the inventory and routing problem for replenishment the car assembly line.

The inbound logistic for feeding the workstation inside the factory represents a critical issue in the car manufacturing industry. Nowadays, this issue is even more critical than in the past since more types of car are being produced in the assembly lines. Consequently, as workstations have to install many types of components, they also need to have an inventory of different types of the component in a compact space. The replenishment is a critical issue since a lack of inventory could cause line stoppage or reworking. On the other hand, an excess of inventory could increase the holding cost or even block the replenishment paths. The decision of the replenishment routes cannot be made without taking into consideration the inventory needed by each station during the production time which will depend on the production sequence. This problem deals with medium-sized instances and it is solved using online solvers. The contribution of this paper is a MILP for the replenishment and inventory of the components in a car assembly line.

A mathematical model for assembly line balancing model to consider disordering sequence of workstations

Purpose – A binary integer programming model for the simple assembly line balancing problem (SALBP), which is well known as SALBP-1, was formulated more than 30 years ago. Since then, a number of researchers have extended the model for the variants of assembly line balancing problem.The model is still prevalent nowadays mainly because of the lower and upper bounds on task assignment. These properties avoid significant increase of decision variables. The purpose of this paper is to use an example to show that the model may lead to a confusing solution. Design/methodology/approach – The paper provides a remedial constraint set for the model to rectify the disordered sequence problem. Findings – The paper presents proof that the assembly line balancing model formulated by Patterson and Albracht may lead to a confusing solution. Originality/value – No one previously has found that the commonly used model is incorrect.

PCB assembly line assignment:a genetic algorithm approach

Purpose – This paper sets out to study a production-planning problem for printed circuit board (PCB) assembly. A PCB assembly company may have a number of assembly lines for production of several product types in large volume. Design/methodology/approach – Pure integer linear programming models are formulated for assigning the product types to assembly lines, which is the line assignment problem, with the objective of minimizing the total production cost. In this approach, unrealistic assignment, which was suffered by previous researchers, is avoided by incorporating several constraints into the model. In this paper, a genetic algorithm is developed to solve the line assignment problem. Findings – The procedure of the genetic algorithm to the problem and a numerical example for illustrating the models are provided. It is also proved that the algorithm is effective and efficient in dealing with the problem. Originality/value – This paper studies the line assignment problem arising in a PCB manufacturing company in which the production volume is high.

Recent Results on Stability Analysis of an Optimal Assembly Line Balance

Two assembly line balancing problems are addressed. The first problem (called SALBP-1) is to minimize number of linearly ordered stations for processing n partially ordered operations V = {1, 2, ..., n} within the fixed cycle time c. The second problem (called SALBP-2) is to minimize cycle time for processing partially ordered operations V on the fixed set of m linearly ordered stations. The processing time ti of each operation i ∈V is known before solving problems SALBP-1 and SALBP-2. However, during the life cycle of the assembly line the values ti are definitely fixed only for the subset of automated operations V\V . Another subset V ⊆ V includes manual operations, for which it is impossible to fix exact processing times during the whole life cycle of the assembly line. If j ∈V , then operation times tj can differ for different cycles of the production process. For the optimal line balance b of the assembly line with operation times t1, t2, ..., tn, we investigate stability of its optimality with respect to possible variations of the processing times tj of the manual operations j ∈ V .